منابع مشابه
Support-Graph Preconditioners for 2-Dimensional Trusses
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the sti ness matrices of 2-dimensional truss structures that are sti y connected. Provided that all the lengths of the trusses are within constant factors of each other, that the angles at the corners of the triangles are bounded away from 0 and , and that the elastic modul...
متن کاملBounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملImproved bounds and algorithms for graph cuts and network reliability
Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximation scheme to estimate the probability that a graph G becomes disconnected, given that its edges are removed independently with probability p. This algorithm runs in n5+o(1)ǫ−3 time to obtain an estimate within relative error ǫ. We improve this run-time through algorithmic and graph-theoretic advances. First...
متن کاملBounds and Algorithms for the Knapsack Problem with Conflict Graph
We study the Knapsack Problem with Conflict Graph (KPCG), an extension of the 0-1 Knapsack Problem, in which a conflict graph describing incompatibilities between items is given. The goal of the KPCG is to select the maximum profit set of compatible items while satisfying the knapsack capacity constraint. We present a Branch-and-Bound approach to derive optimal solutions to the KPCG in short co...
متن کاملTrusses, NP-Completeness, and Genetic Algorithms
The optimization of large trusses often leads to a nearly optimal solution, rather than a truly optimal design. In fact, the problem space for truss optimization grows exponentially with the size of the truss. Using the method of problem reduction, this paper demonstrates that truss optimization is in the set of NP-complete problems. Hence, the only practical techniques for solving the truss pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2020
ISSN: 1526-1719
DOI: 10.7155/jgaa.00527